0.00/0.04	% Problem  : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.00/0.07	% Command  : run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.09/0.42	% Computer : n004.cluster.edu
0.09/0.42	% Model    : x86_64 x86_64
0.09/0.42	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.09/0.42	% Memory   : 8046.5625MB
0.09/0.42	% OS       : Linux 6.8.0-71-generic
0.09/0.42	% CPULimit : 1440
0.09/0.42	% WCLimit  : 180
0.09/0.42	% DateTime : Mon Jul 27 11:27:53 UTC 2026
0.09/0.43	% CPUTime  : 
0.09/0.43	Running run_E /export/starexec/sandbox/benchmark/theBenchmark.p 180 THM
0.09/0.48	Running higher-order theorem proving
0.15/0.57	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=180 /export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p
0.22/1.01	% Version: 3.5.1-ho
0.22/1.01	% Preprocessing class: HSLSSMSMSSSNFFN.
0.22/1.01	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/1.01	% Starting sh3 with 900s (5) cores
0.22/1.01	% Starting lpo1_def_fix with 180s (1) cores
0.22/1.01	% Starting lpo8_s with 180s (1) cores
0.22/1.01	% Starting lpo1_lambda_fix with 180s (1) cores
0.22/1.01	% sh3 with pid 2913327 completed with status 0
0.22/1.01	% Result found by sh3
0.22/1.01	% Preprocessing class: HSLSSMSMSSSNFFN.
0.22/1.01	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/1.01	% Starting sh3 with 900s (5) cores
0.22/1.01	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.22/1.01	% No SInE strategy applied
0.22/1.01	% Search class: HGHSM-FSLM31-DFFFFFNN
0.22/1.01	% Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.22/1.01	% Starting SubtermCWHack with 91s (1) cores
0.22/1.01	% Starting sh3 with 541s (1) cores
0.22/1.01	% Starting lpo1_def_fix with 91s (1) cores
0.22/1.01	% Starting lpo8_s with 91s (1) cores
0.22/1.01	% Starting lpo1_lambda_fix with 86s (1) cores
0.22/1.01	% sh3 with pid 2913343 completed with status 0
0.22/1.01	% Result found by sh3
0.22/1.01	% Preprocessing class: HSLSSMSMSSSNFFN.
0.22/1.01	% Scheduled 4 strats onto 8 cores with 180 seconds (1440 total)
0.22/1.01	% Starting sh3 with 900s (5) cores
0.22/1.01	% (lift_lambdas = 1, lambda_to_forall = 1,unroll_only_formulas = 1, sine = Auto)
0.22/1.01	% No SInE strategy applied
0.22/1.01	% Search class: HGHSM-FSLM31-DFFFFFNN
0.22/1.01	% Scheduled 5 strats onto 5 cores with 900 seconds (900 total)
0.22/1.01	% Starting SubtermCWHack with 91s (1) cores
0.22/1.01	% Starting sh3 with 541s (1) cores
0.22/1.01	% Preprocessing time       : 0.014 s
0.22/1.01	% Presaturation interreduction done
0.22/1.01	
0.22/1.01	% Proof found!
0.22/1.01	% SZS status Theorem
0.22/1.01	% SZS output start CNFRefutation
0.22/1.01	thf(decl_sort1, type, int: $tType).
0.22/1.01	thf(decl_sort2, type, nat: $tType).
0.22/1.01	thf(decl_26, type, one_one_int: int).
0.22/1.01	thf(decl_29, type, plus_plus_int: int > int > int).
0.22/1.01	thf(decl_32, type, times_times_int: int > int > int).
0.22/1.01	thf(decl_40, type, bit0: int > int).
0.22/1.01	thf(decl_41, type, bit1: int > int).
0.22/1.01	thf(decl_43, type, pls: int).
0.22/1.01	thf(decl_44, type, number_number_of_int: int > int).
0.22/1.01	thf(decl_45, type, number_number_of_nat: int > nat).
0.22/1.01	thf(decl_47, type, ord_less_int: int > int > $o).
0.22/1.01	thf(decl_50, type, ord_less_eq_int: int > int > $o).
0.22/1.01	thf(decl_53, type, power_power_int: int > nat > int).
0.22/1.01	thf(decl_64, type, m: int).
0.22/1.01	thf(decl_67, type, t: int).
0.22/1.01	thf(decl_70, type, esk3_0: int).
0.22/1.01	thf(decl_71, type, esk4_0: int).
0.22/1.01	thf(decl_78, type, esk11_0: int).
0.22/1.01	thf(decl_79, type, esk12_0: int).
0.22/1.01	thf(conj_0, conjecture, ?[X38:int, X39:int]:(((plus_plus_int @ (power_power_int @ X38 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X39 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', conj_0)).
0.22/1.01	thf(fact_142_number__of__is__id, axiom, ![X13:int]:(((number_number_of_int @ X13)=(X13))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_142_number__of__is__id)).
0.22/1.01	thf(fact_264_semiring__norm_I110_J, axiom, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_264_semiring__norm_I110_J)).
0.22/1.01	thf(fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J, axiom, ![X58:int]:(((times_times_int @ one_one_int @ X58)=(X58))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J)).
0.22/1.01	thf(fact_200_mult__Bit0, axiom, ![X13:int, X14:int]:(((times_times_int @ (bit0 @ X13) @ X14)=(bit0 @ (times_times_int @ X13 @ X14)))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_200_mult__Bit0)).
0.22/1.01	thf(fact_145_zadd__commute, axiom, ![X25:int, X24:int]:(((plus_plus_int @ X25 @ X24)=(plus_plus_int @ X24 @ X25))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_145_zadd__commute)).
0.22/1.01	thf(fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06, axiom, (?[X38:int, X39:int]:(((plus_plus_int @ (power_power_int @ X38 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X39 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))<=((t)=(one_one_int))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)).
0.22/1.01	thf(fact_249_add__Bit1__Bit0, axiom, ![X13:int, X14:int]:(((plus_plus_int @ (bit1 @ X13) @ (bit0 @ X14))=(bit1 @ (plus_plus_int @ X13 @ X14)))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_249_add__Bit1__Bit0)).
0.22/1.01	thf(fact_202_add__Pls, axiom, ![X13:int]:(((plus_plus_int @ pls @ X13)=(X13))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_202_add__Pls)).
0.22/1.01	thf(fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06, axiom, (?[X38:int, X39:int]:(((plus_plus_int @ (power_power_int @ X38 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X39 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))<=(ord_less_int @ one_one_int @ t)), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06)).
0.22/1.01	thf(fact_37_zless__le, axiom, ![X25:int, X24:int]:(((ord_less_int @ X25 @ X24)<=>(((X25)!=(X24))&(ord_less_eq_int @ X25 @ X24)))), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_37_zless__le)).
0.22/1.01	thf(fact_0_tpos, axiom, (ord_less_eq_int @ one_one_int @ t), file('/export/starexec/sandbox/tmp/tmp.ciN8SCpW7O/E---3.1_2913305.p', fact_0_tpos)).
0.22/1.01	thf(c_0_12, negated_conjecture, ~(?[X38:int, X39:int]:(((plus_plus_int @ (power_power_int @ X38 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X39 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))), inference(assume_negation,[status(cth)],[conj_0])).
0.22/1.01	thf(c_0_13, plain, ![X3027:int]:(((number_number_of_int @ X3027)=(X3027))), inference(variable_rename,[status(thm)],[fact_142_number__of__is__id])).
0.22/1.01	thf(c_0_14, negated_conjecture, ![X2351:int, X2352:int]:(((plus_plus_int @ (power_power_int @ X2351 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X2352 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_12])])])).
0.22/1.01	thf(c_0_15, plain, ((one_one_int)=(number_number_of_int @ (bit1 @ pls))), inference(split_conjunct,[status(thm)],[fact_264_semiring__norm_I110_J])).
0.22/1.01	thf(c_0_16, plain, ![X3:int]:(((number_number_of_int @ X3)=(X3))), inference(split_conjunct,[status(thm)],[c_0_13])).
0.22/1.01	thf(c_0_17, plain, ![X2221:int]:(((times_times_int @ one_one_int @ X2221)=(X2221))), inference(variable_rename,[status(thm)],[fact_188_comm__semiring__1__class_Onormalizing__semiring__rules_I11_J])).
0.22/1.01	thf(c_0_18, negated_conjecture, ![X3:int, X4:int]:(((plus_plus_int @ (power_power_int @ X3 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.22/1.01	thf(c_0_19, plain, ((one_one_int)=(bit1 @ pls)), inference(rw,[status(thm)],[c_0_15, c_0_16])).
0.22/1.01	thf(c_0_20, plain, ![X2318:int, X2319:int]:(((times_times_int @ (bit0 @ X2318) @ X2319)=(bit0 @ (times_times_int @ X2318 @ X2319)))), inference(variable_rename,[status(thm)],[fact_200_mult__Bit0])).
0.22/1.01	thf(c_0_21, plain, ![X3:int]:(((times_times_int @ one_one_int @ X3)=(X3))), inference(split_conjunct,[status(thm)],[c_0_17])).
0.22/1.01	thf(c_0_22, negated_conjecture, ![X3:int, X4:int]:(((plus_plus_int @ (power_power_int @ X3 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (times_times_int @ (bit0 @ (bit0 @ (bit1 @ pls))) @ m) @ (bit1 @ pls)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_18, c_0_16]), c_0_19])).
0.22/1.01	thf(c_0_23, plain, ![X3:int, X4:int]:(((times_times_int @ (bit0 @ X3) @ X4)=(bit0 @ (times_times_int @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_20])).
0.22/1.01	thf(c_0_24, plain, ![X3:int]:(((times_times_int @ (bit1 @ pls) @ X3)=(X3))), inference(rw,[status(thm)],[c_0_21, c_0_19])).
0.22/1.01	thf(c_0_25, plain, ![X2677:int, X2678:int]:(((plus_plus_int @ X2677 @ X2678)=(plus_plus_int @ X2678 @ X2677))), inference(variable_rename,[status(thm)],[fact_145_zadd__commute])).
0.22/1.01	thf(c_0_26, plain, (((t)=(one_one_int))=>?[X38:int, X39:int]:(((plus_plus_int @ (power_power_int @ X38 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X39 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))), inference(fof_simplification,[status(thm)],[fact_1__096t_A_061_A1_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])).
0.22/1.01	thf(c_0_27, negated_conjecture, ![X3:int, X4:int]:(((plus_plus_int @ (power_power_int @ X3 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (bit0 @ (bit0 @ m)) @ (bit1 @ pls)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_22, c_0_23]), c_0_23]), c_0_24])).
0.22/1.01	thf(c_0_28, plain, ![X4:int, X3:int]:(((plus_plus_int @ X3 @ X4)=(plus_plus_int @ X4 @ X3))), inference(split_conjunct,[status(thm)],[c_0_25])).
0.22/1.01	thf(c_0_29, plain, ![X2696:int, X2697:int]:(((plus_plus_int @ (bit1 @ X2696) @ (bit0 @ X2697))=(bit1 @ (plus_plus_int @ X2696 @ X2697)))), inference(variable_rename,[status(thm)],[fact_249_add__Bit1__Bit0])).
0.22/1.01	thf(c_0_30, plain, ![X3467:int]:(((plus_plus_int @ pls @ X3467)=(X3467))), inference(variable_rename,[status(thm)],[fact_202_add__Pls])).
0.22/1.01	thf(c_0_31, plain, ((ord_less_int @ one_one_int @ t)=>?[X38:int, X39:int]:(((plus_plus_int @ (power_power_int @ X38 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X39 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int)))), inference(fof_simplification,[status(thm)],[fact_2__0961_A_060_At_A_061_061_062_AEX_Ax_Ay_O_Ax_A_094_A2_A_L_Ay_A_094_A2_A_06])).
0.22/1.01	thf(c_0_32, plain, ![X25:int, X24:int]:(((ord_less_int @ X25 @ X24)<=>(((X25)!=(X24))&(ord_less_eq_int @ X25 @ X24)))), inference(fof_simplification,[status(thm)],[fact_37_zless__le])).
0.22/1.01	thf(c_0_33, plain, (((t)!=(one_one_int))|((plus_plus_int @ (power_power_int @ esk3_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk4_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_26])])])])).
0.22/1.01	thf(c_0_34, negated_conjecture, ![X3:int, X4:int]:(((plus_plus_int @ (power_power_int @ X3 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(plus_plus_int @ (bit1 @ pls) @ (bit0 @ (bit0 @ m))))), inference(rw,[status(thm)],[c_0_27, c_0_28])).
0.22/1.01	thf(c_0_35, plain, ![X3:int, X4:int]:(((plus_plus_int @ (bit1 @ X3) @ (bit0 @ X4))=(bit1 @ (plus_plus_int @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_29])).
0.22/1.01	thf(c_0_36, plain, ![X3:int]:(((plus_plus_int @ pls @ X3)=(X3))), inference(split_conjunct,[status(thm)],[c_0_30])).
0.22/1.01	thf(c_0_37, plain, (~(ord_less_int @ one_one_int @ t)|((plus_plus_int @ (power_power_int @ esk11_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk12_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))), inference(fof_nnf,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_31])])])])).
0.22/1.01	thf(c_0_38, plain, ![X2172:int, X2173:int]:((((((X2172)!=(X2173))|~(ord_less_int @ X2172 @ X2173))&((ord_less_eq_int @ X2172 @ X2173)|~(ord_less_int @ X2172 @ X2173)))&(((X2172)=(X2173))|~(ord_less_eq_int @ X2172 @ X2173)|(ord_less_int @ X2172 @ X2173)))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_32])])])])).
0.22/1.01	thf(c_0_39, plain, (ord_less_eq_int @ one_one_int @ t), inference(split_conjunct,[status(thm)],[fact_0_tpos])).
0.22/1.01	thf(c_0_40, plain, (((plus_plus_int @ (power_power_int @ esk3_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk4_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))|((t)!=(one_one_int))), inference(split_conjunct,[status(thm)],[c_0_33])).
0.22/1.01	thf(c_0_41, negated_conjecture, ![X3:int, X4:int]:(((plus_plus_int @ (power_power_int @ X3 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ X4 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))!=(bit1 @ (bit0 @ m)))), inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_34, c_0_35]), c_0_36])).
0.22/1.01	thf(c_0_42, plain, (((plus_plus_int @ (power_power_int @ esk11_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))) @ (power_power_int @ esk12_0 @ (number_number_of_nat @ (bit0 @ (bit1 @ pls)))))=(plus_plus_int @ (times_times_int @ (number_number_of_int @ (bit0 @ (bit0 @ (bit1 @ pls)))) @ m) @ one_one_int))|~((ord_less_int @ one_one_int @ t))), inference(split_conjunct,[status(thm)],[c_0_37])).
0.22/1.01	thf(c_0_43, plain, ![X3:int, X4:int]:((((X3)=(X4))|(ord_less_int @ X3 @ X4)|~((ord_less_eq_int @ X3 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_38])).
0.22/1.01	thf(c_0_44, plain, (ord_less_eq_int @ (bit1 @ pls) @ t), inference(rw,[status(thm)],[c_0_39, c_0_19])).
0.22/1.01	thf(c_0_45, plain, ((t)!=(bit1 @ pls)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_40, c_0_16]), c_0_23]), c_0_23]), c_0_24]), c_0_19]), c_0_28]), c_0_35]), c_0_36]), c_0_19]), c_0_41])).
0.22/1.01	thf(c_0_46, plain, ~((ord_less_int @ (bit1 @ pls) @ t)), inference(sr,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[c_0_42, c_0_16]), c_0_23]), c_0_23]), c_0_24]), c_0_19]), c_0_28]), c_0_35]), c_0_36]), c_0_19]), c_0_41])).
0.22/1.01	thf(c_0_47, plain, ($false), inference(sr,[status(thm)],[inference(sr,[status(thm)],[inference(spm,[status(thm)],[c_0_43, c_0_44]), c_0_45]), c_0_46]), ['proof']).
0.22/1.01	% SZS output end CNFRefutation
0.22/1.01	% Parsed axioms                        : 748
0.22/1.01	% Removed by relevancy pruning/SinE    : 0
0.22/1.01	% Initial clauses                      : 984
0.22/1.01	% Removed in clause preprocessing      : 71
0.22/1.01	% Initial clauses in saturation        : 913
0.22/1.01	% Processed clauses                    : 1166
0.22/1.01	% ...of these trivial                  : 142
0.22/1.01	% ...subsumed                          : 170
0.22/1.01	% ...remaining for further processing  : 854
0.22/1.01	% Other redundant clauses eliminated   : 95
0.22/1.01	% Clauses deleted for lack of memory   : 0
0.22/1.01	% Backward-subsumed                    : 7
0.22/1.01	% Backward-rewritten                   : 55
0.22/1.01	% Generated clauses                    : 307
0.22/1.01	% ...of the previous two non-redundant : 237
0.22/1.01	% ...aggressively subsumed             : 0
0.22/1.01	% Contextual simplify-reflections      : 1
0.22/1.01	% Paramodulations                      : 227
0.22/1.01	% Factorizations                       : 0
0.22/1.01	% NegExts                              : 0
0.22/1.01	% Equation resolutions                 : 98
0.22/1.01	% Disequality decompositions           : 0
0.22/1.01	% Total rewrite steps                  : 1483
0.22/1.01	% ...of those cached                   : 1249
0.22/1.01	% Propositional unsat checks           : 0
0.22/1.01	%    Propositional check models        : 0
0.22/1.01	%    Propositional check unsatisfiable : 0
0.22/1.01	%    Propositional clauses             : 0
0.22/1.01	%    Propositional clauses after purity: 0
0.22/1.01	%    Propositional unsat core size     : 0
0.22/1.01	%    Propositional preprocessing time  : 0.000
0.22/1.01	%    Propositional encoding time       : 0.000
0.22/1.01	%    Propositional solver time         : 0.000
0.22/1.01	%    Success case prop preproc time    : 0.000
0.22/1.01	%    Success case prop encoding time   : 0.000
0.22/1.01	%    Success case prop solver time     : 0.000
0.22/1.01	% Current number of processed clauses  : 148
0.22/1.01	%    Positive orientable unit clauses  : 65
0.22/1.01	%    Positive unorientable unit clauses: 2
0.22/1.01	%    Negative unit clauses             : 24
0.22/1.01	%    Non-unit-clauses                  : 57
0.22/1.01	% Current number of unprocessed clauses: 547
0.22/1.01	% ...number of literals in the above   : 1168
0.22/1.01	% Current number of archived formulas  : 0
0.22/1.01	% Current number of archived clauses   : 630
0.22/1.01	% Clause-clause subsumption calls (NU) : 38420
0.22/1.01	% Rec. Clause-clause subsumption calls : 21503
0.22/1.01	% Non-unit clause-clause subsumptions  : 103
0.22/1.01	% Unit Clause-clause subsumption calls : 598
0.22/1.01	% Rewrite failures with RHS unbound    : 3
0.22/1.01	% BW rewrite match attempts            : 267
0.22/1.01	% BW rewrite match successes           : 173
0.22/1.01	% Condensation attempts                : 0
0.22/1.01	% Condensation successes               : 0
0.22/1.01	% Termbank termtop insertions          : 82294
0.22/1.01	% Search garbage collected termcells   : 14041
0.22/1.01	
0.22/1.01	% -------------------------------------------------
0.22/1.01	% User time                : 0.156 s
0.22/1.01	% System time              : 0.017 s
0.22/1.01	% Total time               : 0.173 s
0.22/1.01	% Maximum resident set size: 7136 pages
0.22/1.01	
0.22/1.01	% -------------------------------------------------
0.22/1.01	% User time                : 0.572 s
0.22/1.01	% System time              : 0.066 s
0.22/1.01	% Total time               : 0.638 s
0.22/1.01	% Maximum resident set size: 6144 pages
0.22/1.01	% E exiting
0.22/1.02	EOF